Verification of Program Transformations with Inductive Refinement Types

High-level transformation languages like Rascal include expressive features for manipulating large abstract syntax trees: first-class traversals, pattern matching, backtracking, and generalized iterators. We present the design implementation of an interpretation tool, Rabit, verifying inductive type shape properties transformations written in such languages. describe how to perform based on operational semantics, specifically focusing challenges arising when analyzing traversals matching. Finally, we evaluate Rabit a series (normalization, desugaring, refactoring, code generators, inference, etc.) showing that can effectively verify stated properties.